Matrix maps over planar near-rings

نویسندگان

  • Wen-Fong Ke
  • Johan H. Meyer
  • Gerhard Wendt
چکیده

Following a method by Meldrum and van der Walt, near-rings of matrix maps are defined for general near-rings, not necessarily with identity. The influence of one-sided identities is discussed. When the base near-ring is integral and planar, the near-ring of matrix maps is shown to be simple. Various types of primitivity of the near-ring of matrix maps are discussed when the base near-ring is planar but not integral. Finally, an open problem concerning bijective matrix maps is solved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

NILPOTENT GRAPHS OF MATRIX ALGEBRAS

Let $R$ be a ring with unity. The undirected nilpotent graph of $R$, denoted by $Gamma_N(R)$, is a graph with vertex set ~$Z_N(R)^* = {0neq x in R | xy in N(R) for some y in R^*}$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy in N(R)$, or equivalently, $yx in N(R)$, where $N(R)$ denoted the nilpotent elements of $R$. Recently, it has been proved that if $R$ is a left A...

متن کامل

Gray Images of Constacyclic Codes over some Polynomial Residue Rings

Let  be the quotient ring    where  is the finite field of size   and  is a positive integer. A Gray map  of length  over  is a special map from  to ( . The Gray map   is said to be a ( )-Gray map if the image of any -constacyclic code over    is a -constacyclic code over the field   . In this paper we investigate the existence of   ( )-Gray maps over . In this direction, we find an equivalent ...

متن کامل

How Round is a Circle? Constructions of Double and Circular Planar Near-Rings

A construction procedure for planar near-rings is provided. Amongst others, this method will show why many planar near-rings come in pairs with “opposite” geometries and it will also lead to the construction of many new infinite circular planar near-rings.

متن کامل

Analysis of Planar Microstrip Circuits Using Three-Dimensional Transmission Line Matrix Method

The frequency-dependent characteristics of microstrip planar circuits have been previously analyzed using several full-wave approaches. All those methods directly give characteristic of the circuits frequency by frequency. Computation time becomes important if these planar circuits have to be studied over a very large bandwidth. The transmission line matrix (TLM) method presented in this paper ...

متن کامل

Diagonal Matrix Reduction over Refinement Rings

  Abstract: A ring R is called a refinement ring if the monoid of finitely generated projective R- modules is refinement.  Let R be a commutative refinement ring and M, N, be two finitely generated projective R-nodules, then M~N  if and only if Mm ~Nm for all maximal ideal m of  R. A rectangular matrix A over R admits diagonal reduction if there exit invertible matrices p and Q such that PAQ is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010